An experiment on Lowest Unique Integer Games
نویسندگان
چکیده
منابع مشابه
On ‘ Reverse Auction : the Lowest Unique Positive Integer Game
Received (received date) Revised (revised date) Accepted (accepted date) In Zeng et al. [Fluct. Noise Lett. 7 (2007) L439–L447] the analysis of the lowest unique positive integer game is simplified by some reasonable assumptions that make the problem tractable for arbitrary numbers of players. However, here we show that the solution obtained for rational players is not a Nash equilibrium and th...
متن کاملBehavioral Heterogeneity Affects Individual Performances in Experimental and Computational Lowest Unique Integer Games
This study computationally examines (1) how the behaviors of subjects are represented, (2) whether the classification of subjects is related to the scale of the game, and (3) what kind of behavioral models are successful in small-sized lowest unique integer games (LUIGs). In a LUIG, N (≥ 3) players submit a positive integer up to M(> 1) and the player choosing the smallest number not chosen by ...
متن کاملEquilibrium solution to the lowest unique positive integer game
Received (received date) Revised (revised date) Accepted (accepted date) We address the equilibrium concept of a reverse auction game so that no one can enhance the individual payoff by a unilateral change when all the others follow a certain strategy. In this approach the combinatorial possibilities to consider become very much involved even for a small number of players, which has hindered a ...
متن کاملReverse Auction: the Lowest Unique Positive Integer Game
A reverse auction can be likened to a tendering process where a contract is awarded to the lowest bidder. This is in contrast to a conventional forward auction where the highest bidder wins. In this paper we analyze a minority game version of the reverse auction where an extra condition is imposed that, namely, the bid must be unique. In other words, the bidder with the lowest positive unique i...
متن کاملOn Khot’s Unique Games Conjecture
In 2002, Subhash Khot formulated the Unique Games Conjecture, a conjecture about the computational complexity of certain optimization problems. The conjecture has inspired a remarkable body of work, which has clarified the computational complexity of several optimization problems and the effectiveness of “semidefinite programming” convex relaxations. In this paper, which assumes no prior knowle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica A: Statistical Mechanics and its Applications
سال: 2016
ISSN: 0378-4371
DOI: 10.1016/j.physa.2016.06.108